updating$93479$ - tradução para alemão
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

updating$93479$ - tradução para alemão

OPTIMIZATION METHOD
DFP updating formula; Davidon-Fletcher-Powell formula; Davidon-Fletcher-Powell; Davidon–Fletcher–Powell algorithm; Davidon–Fletcher–Powell; Davidon-Fletcher-Powell algorithm; Davidson-Fletcher-Powell

updating      
n. Aktualisieren
bug fix         
  • A program tape for the 1944 [[Harvard Mark I]], one of the first digital computers. Note physical patches used to correct punched holes by covering them.
PIECE OF SOFTWARE DESIGNED TO UPDATE A COMPUTER PROGRAM TO FIX OR IMPROVE IT
Software patch; One-line fix; Critical update; Slipstream (computing); Software update; Patch (software); Bug fix; Bugfix; Security patches; Security patch; Software hot patch; Patch-management; Antivulnerability software; Antivulnerability Software; Antivulnerability; Patch (program); Software Update; Software patches; Patch (gaming); Corrective Service Diskette; Security update; Patchkit; Software patching; Security patched; Security updated; Security updating; Security patching; Software Updates; Patchset; Hot patching; Hot patch; Live patching; Source diff; Firmware update; Software update system; Automatic software updates; Automatic software update; Binary patch; Game patch; Video game patch; Software updates; Source code patch; Automatic upgrade; Automated patch management
Bug-fix, rogramm das Bugs eines anderen Computerprogramms repariert (Computer)

Definição

bug fix
<programming> A change to a program or system intended to permanently cure a bug. Often a fix for one bug inadvertantly introduces new bugs, hence the need for careful forethought and testing. Compare: workaround. (1998-06-25)

Wikipédia

Davidon–Fletcher–Powell formula

The Davidon–Fletcher–Powell formula (or DFP; named after William C. Davidon, Roger Fletcher, and Michael J. D. Powell) finds the solution to the secant equation that is closest to the current estimate and satisfies the curvature condition. It was the first quasi-Newton method to generalize the secant method to a multidimensional problem. This update maintains the symmetry and positive definiteness of the Hessian matrix.

Given a function f ( x ) {\displaystyle f(x)} , its gradient ( f {\displaystyle \nabla f} ), and positive-definite Hessian matrix B {\displaystyle B} , the Taylor series is

f ( x k + s k ) = f ( x k ) + f ( x k ) T s k + 1 2 s k T B s k + , {\displaystyle f(x_{k}+s_{k})=f(x_{k})+\nabla f(x_{k})^{T}s_{k}+{\frac {1}{2}}s_{k}^{T}{B}s_{k}+\dots ,}

and the Taylor series of the gradient itself (secant equation)

f ( x k + s k ) = f ( x k ) + B s k + {\displaystyle \nabla f(x_{k}+s_{k})=\nabla f(x_{k})+Bs_{k}+\dots }

is used to update B {\displaystyle B} .

The DFP formula finds a solution that is symmetric, positive-definite and closest to the current approximate value of B k {\displaystyle B_{k}} :

B k + 1 = ( I γ k y k s k T ) B k ( I γ k s k y k T ) + γ k y k y k T , {\displaystyle B_{k+1}=(I-\gamma _{k}y_{k}s_{k}^{T})B_{k}(I-\gamma _{k}s_{k}y_{k}^{T})+\gamma _{k}y_{k}y_{k}^{T},}

where

y k = f ( x k + s k ) f ( x k ) , {\displaystyle y_{k}=\nabla f(x_{k}+s_{k})-\nabla f(x_{k}),}
γ k = 1 y k T s k , {\displaystyle \gamma _{k}={\frac {1}{y_{k}^{T}s_{k}}},}

and B k {\displaystyle B_{k}} is a symmetric and positive-definite matrix.

The corresponding update to the inverse Hessian approximation H k = B k 1 {\displaystyle H_{k}=B_{k}^{-1}} is given by

H k + 1 = H k H k y k y k T H k y k T H k y k + s k s k T y k T s k . {\displaystyle H_{k+1}=H_{k}-{\frac {H_{k}y_{k}y_{k}^{T}H_{k}}{y_{k}^{T}H_{k}y_{k}}}+{\frac {s_{k}s_{k}^{T}}{y_{k}^{T}s_{k}}}.}

B {\displaystyle B} is assumed to be positive-definite, and the vectors s k T {\displaystyle s_{k}^{T}} and y {\displaystyle y} must satisfy the curvature condition

s k T y k = s k T B s k > 0. {\displaystyle s_{k}^{T}y_{k}=s_{k}^{T}Bs_{k}>0.}

The DFP formula is quite effective, but it was soon superseded by the Broyden–Fletcher–Goldfarb–Shanno formula, which is its dual (interchanging the roles of y and s).